An angel theorem for triangulations of the plane
نویسنده
چکیده
Recently the so called angel problem was solved independently by four authors. We establish an analogous theorem for triangulations of the plane and derive a solution to the original angel problem from this theorem. Compared to earlier solutions, our approach gives a simpler proof as well as a weaker winning angel. We show that an angel moving from the middle square to any other square of a 3 by 5 rectangle is winning.
منابع مشابه
Generating the triangulations of the projective plane
A theorem of Steinitz [2] states that the triangulations of the 2-sphere can be generated from the triangulation S with four vertices by a process called vertex splitting. That is, given any triangulation T of the 2sphere, there is a sequence of triangulations S = T,, T, ,..., T,_, , T,, = T, such that each triangulation except T, is obtained from its predecessor by vertex splitting. In this pa...
متن کاملA Quantitative Steinitz Theorem for Plane Triangulations
We give a new proof of Steinitz’s classical theorem in the case of plane triangulations, which allows us to obtain a new general bound on the grid size of the simplicial polytope realizing a given triangulation, subexponential in a number of special cases. Formally, we prove that every plane triangulation G with n vertices can be embedded in R in such a way that it is the vertical projection of...
متن کاملTwo Equivalent Presentations for the Norm of Weighted Spaces of Holomorphic Functions on the Upper Half-plane
Introduction In this paper, we intend to show that without any certain growth condition on the weight function, we always able to present a weighted sup-norm on the upper half plane in terms of weighted sup-norm on the unit disc and supremum of holomorphic functions on the certain lines in the upper half plane. Material and methods We use a certain transform between the unit dick and the uppe...
متن کاملA new proof of 3-colorability of Eulerian triangulations
Using the existence of noncrossing Eulerian circuits in Eulerian plane graphs, we give a short constructive proof of the theorem of Heawood that Eulerian triangulations are 3-colorable.
متن کاملOn Delaunay Oriented Matroids for Convex Distance Functions
For any nite point set S in Ed, an oriented matroid DOM(S) can be de ned in terms of how S is partitioned by Euclidean hyperspheres. This oriented matroid is related to the Delaunay triangulation of S and is realizable, because of the lifting property of Delaunay triangulations. We prove that the same construction of a Delaunay oriented matroid can be performed with respect to any smooth, stric...
متن کامل